Independence for Full Conditional Measures and their Graphoid Properties
نویسندگان
چکیده
This paper examines definitions of independence for events and variables in the context of full conditional measures; that is, when conditional probability is a primitive notion and conditioning is allowed on null events. Independence concepts are evaluated with respect to graphoid properties; we show that properties of weak union, contraction and intersection may fail when null events are present.
منابع مشابه
Independence for Full Conditional Measures, Graphoids and Bayesian Networks
This paper examines definitions of independence for events and variables in the context of full conditional measures; that is, when conditional probability is a primitive notion and conditioning is allowed on null events. Several independence concepts are evaluated with respect to graphoid properties; we show that properties of weak union, contraction and intersection may fail when null events ...
متن کاملConditional products: An alternative approach to conditional independence
We introduce a new abstract approach to the study of conditional independence, founded on a concept analogous to the factoriza-tion properties of probabilistic independence, rather than the separation properties of a graph. The basic ingredient is the \con-ditional product", which provides a way of combining the objects under consideration while preserving as much independence as possible. We i...
متن کاملGenerating Graphoids from Generalised Conditional Probability
We take a general approach to uncertainty on product spaces, and give sufficient conditions for the independence structures of uncertainty measures to satisfy graphoid properties. Since these conditions are arguably more intuitive than some of the graphoid properties, they can be viewed as explanations why probability and certain other formalisms generate graphoids. The conditions include a suf...
متن کاملA note on nonsymmetric independence models
In probability and statistics graphs are used to describe conditional independence structures (or analogously dependence/association structures) among the variables. Actually, there are three main classic approaches based on undirected graphs [10], directed acyclic graphs [11], or chain graphs [12]. These graphical structures obey graphoid properties (i.e. symmetry, decomposition, weak union, c...
متن کاملGraphical Representation of Asymmetric Graphoid Structures
Independence models induced by some uncertainty measures (e.g. conditional probability, possibility) do not obey the usual graphoid properties, since they do not satisfy the symmetry property. They are efficiently representable through directed acyclic l-graphs by using L-separation criterion. In this paper, we show that in general there is not a l-graph which describes completely all the indep...
متن کامل